Designs of optimal switching feedback decentralized control policies for re-entrant queueing networks: A case study
نویسندگان
چکیده
We study the problem of optimal feedback switching control of two-server re-entrant manufacturing network with nozero setup times introduced by Kumar and Seidman. The optimal steadystate (periodic) behavior is determined for the system in the analytical form. A simple feedback switching control law is proposed under which the process in the system converges to the optimal steady state behavior irrespective of the initial state. This law is cyclic and distributed: the servers do not need information about the entire system state. Each of them proceeds basically from the local data concerning only the currently served queue, although a fixed finite number of one-bit notification signals should be exchanged between the servers during every cycle. The framework of Kumar-Seidman model is used for presentation of a methodology of both design of a switching policy and justification of its convergence.
منابع مشابه
Stability of multi-class queueing networks with infinite virtual queues
We generalize the standard multi-class queueing network model by allowing both standard queues and infinite virtual queues which have infinite supply of work. We pose the general problem of finding policies which allow some of the nodes of the network to work with full utilization, and yet keep all the standard queues in the system stable. Towards this end we show that re-entrant lines, systems...
متن کاملDecentralized Routing and Power Allocation in FDMA Wireless Networks based on H∞ Fuzzy Control Strategy
Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....
متن کاملOptimal Stochastic Scheduling of Forest Networks with Switching Penalties Author(s):
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch set-up delays which are incurred at each instant the server processes a job in a queue different from the previous one. We use ...
متن کاملTheorem: Performance of Fcfs under Regulators. Consider the M N Re-entrant
9] P. R. Kumar and S. Meyn, \Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies," tech. rep.,
متن کاملDecentralized Goal Assignment and Trajectory Generation in Multi-Robot Networks
This paper considers the problem of decentralized goal assignment and trajectory generation for multi-robot networks when only local communication is available, and proposes an approach based on methods related to switched systems and set invariance. A family of Lyapunov-like functions is employed to encode the (local) decision making among candidate goal assignments, under which the agents pic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011